Discrete-Time Process Algebra with Empty Process
نویسندگان
چکیده
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is paid to the considerations and problems that arise when introducing the empty process. We prove time determinacy, soundness, completeness, and the axioms of standard concurrency. 1991 Mathematics Subject Classification: 68Q10, 68Q22, 68Q55. 1991 CR Categories: D.1.3, D.3.1, F.1.2, F.3.2.
منابع مشابه
DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملWavelet Based Estimation of the Derivatives of a Density for a Discrete-Time Stochastic Process: Lp-Losses
We propose a method of estimation of the derivatives of probability density based on wavelets methods for a sequence of random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for such estimators. We suppose that the process is strongly mixing and we show that the rate of convergence essentially depends on the behavior of a special quad...
متن کاملDiscrete Time Process Algebra with Relative Timing
Process algebra in the form of ACP describes the main features of imperative concurrent programming without explicit mention of time. Implicitly, time is present in the interpretation of sequential composition: in p · q the process p must be executed before q. A quantative view on the relation between process execution and progress of time is absent in ACP, however. Process algebras can be deve...
متن کاملAppointment process of open-heart surgery in Shahid Rajaei Heart Hospital using a discrete event simulation approach
Background: The waiting list is a list of selected patients in the surgical queue. If demand exceeds capacity, the waiting list grows rapidly, which may lead to unacceptable waiting for patients, especially those in need of acute medical care. Patients waiting for heart surgery are placed on the waiting list for surgery, and sometimes the waiting time is longer than patients expect. Reducing th...
متن کامل